Accelerating Spatial Join Operations using Bit-Indices
نویسندگان
چکیده
Spatial join is a very expensive operation in spatial databases. In this paper, we propose an innovative method for accelerating spatial join operations using Spatial Join Bitmap (SJB) indices. The SJB indices are used to keep track of intersecting entities in the joining data sets. We provide algorithms for constructing SJB indices and for maintaining the SJB indices when the data sets are updated. We have performed an extensive study using both real and synthetic data sets of various data distributions. The results show that the use of SJB indices produces substantial speedup ranging from 25% to 150% when compared to Filter trees.
منابع مشابه
Distance-Associated Join Indices for Spatial Range Search
Spatial join indices are join indices constructed for spatial objects. Similar to join indices for relational database systems, spatial join indices improve efficiency of spatial join operations. In this paper, a distanceassociated join index structure is developed to speed up spatial queries especially for spatial range queries. Three distance-associated join indexing mechanisms: basic, ring-s...
متن کاملThe Design and Implementation of Seeded Trees: an Eecient Method for Spatial Joins
| Existing methods for spatial joins require pre-existing spatial indices or other pre-computation, but such approaches are ineecient and limited in generality. Operand datasets of spatial joins may not all have pre-computed indices, particularly when they are dynamically generated by other selection or join operations. Also, existing spatial indices are mostly designed for spatial selections, ...
متن کاملThe Design and Implementation of Seeded Trees: An Efficient Method for Spatial Joins
Existing methods for spatial joins require pre-existing spatial indices or other precomputation, but such approaches are inefficient and limited in generality. Operand data sets of spatial joins may not all have precomputed indices, particularly when they are dynamically generated by other selection or join operations. Also, existing spatial indices are mostly designed for spatial selections, a...
متن کاملJoin Index Hierarchy: An Indexing Structure for Efficient Navigation in Object-Oriented Databases
A novel indexing structure, join index hierarchy, is proposed to handle the \goto's on disk" problem in object-oriented query processing. The method constructs a hierarchy of join indices and transforms a sequence of pointer chasing operations into a simple search in an appropriate join index le, and thus accelerates navigation in object-oriented databases. The method extends the join index str...
متن کاملMulti - Step Processing of Spatial Joins
Spatial joins are one of the most important operations for combining spatial objects of several relations. In this paper, spatial join processing is studied in detail for extended spatial objects in two-dimensional data space. We present an approach for spatial join processing that is based on three steps. First, a spatial join is performed on the minimum bounding rectangles of the objects retu...
متن کامل